Repeat-Free Codes

In this paper we consider the problem of encoding data into repeat-free sequences in which are imposed to contain any k-tuple at most once (for predefined k). First, capacity constraint calculated. Then, an efficient algorithm, uses two bits redundancy, is presented encode length- n for k=2+2log(n). This algorithm then improved support value k form k=alog(n), 1 <; a, while its redundancy o(n). We also calculate when combined with local constraints given by a constrained system, and multi-dimensional codes.